Direct Schur Complement Method by Hierarchical Matrix Techniques

نویسندگان

  • Wolfgang Hackbusch
  • Boris N. Khoromskij
  • Ronald Kriemann
چکیده

The goal of this paper is the construction of a data-sparse approximation to the Schur complement on the interface corresponding to FEM and BEM approximations of an elliptic equation by domain decomposition. Using the hierarchical (H-matrix) formats we elaborate the approximate Schur complement inverse in an explicit form. The required cost O(NΓ log q NΓ ) is almost linear in NΓ – the number of degrees of freedom on the interface. As input, we use the Schur complement matrices corresponding to subdomains and represented in the H-matrix format. In the case of piecewise constant coefficients these matrices can be computed via the BEM representation with the cost O(NΓ log q NΓ ), while in the general case the FEM discretisation leads to the complexity O(NΩ log q NΩ).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct Schur Complement Method by Domain Decomposition Based on H-Matrix Approximation

The goal of this paper is the construction of a data-sparse approximation to the Schur complement on the interface corresponding to FEM and BEM approximations of an elliptic equation by domain decomposition. Using the hierarchical (H-matrix) formats we elaborate the approximate Schur complement inverse in an explicit form. The required cost O(NΓ log NΓ) is almost linear in NΓ – the number of de...

متن کامل

SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX

This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...

متن کامل

On techniques to improve robustness and scalability of the Schur complement method

A hybrid linear solver based on the Schur complement method has great potential to be a general purpose solver scalable on tens of thousands of processors. It is imperative to exploit two levels of parallelism; namely, solving independent subdomains in parallel and using multiple processors per subdomain. This hierarchical parallelism can lead to a scalable implementation which maintains numeri...

متن کامل

Conception d'un solveur linéaire creux parallèle hybride direct-itératif. (Design of a parallel hybrid direct/iterative sparse linear solver)

This thesis presents a parallel resolution method for sparse linear systems which combines effectively techniques of direct and iterative solvers using a Schur complement approach. A domain decomposition is built ; the interiors of the subdomains are eliminated by a direct method in order to use an iterative method only on the interface unknowns. The system on the interface (Schur complement) i...

متن کامل

On Techniques to Improve Robustness and Scalability of a Parallel Hybrid Linear Solver

A hybrid linear solver based on the Schur complement method has great potential to be a general purpose solver scalable on tens of thousands of processors. For this, it is imperative to exploit two levels of parallelism; namely, solving independent subdomains in parallel and using multiple processors per subdomain. This hierarchical parallelism can lead to a scalable implementation which mainta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004